Compact families of Jordan curves and convex hulls in three dimensions

نویسنده

  • Colm O. Dunlaing
چکیده

We prove that for certain families of semi-algebraic convex bodies in R3, the convex hull of n disjoint bodies has O(nλs(n)) features, where s is a constant depending on the family: λs(n) is the maximum length of order-s Davenport-Schinzel sequences with n letters. The argument is based on an apparently new idea of ‘compact families’ of convex bodies or discs, and of ‘crossing content’ and ‘footprint width’ among disc intersections.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Characterization of some Families of Closed Convex Sets∗

This paper deals with the characterization of the sums of compact convex sets with linear subspaces, simplices, sandwiches (convex hulls of pairs of parallel affine manifolds) and parallelotopes in terms of the so-called internal and conical representations, topological and geometrical properties. In particular, it is shown that a closed convex set is a sandwich if and only if its relative boun...

متن کامل

Classification of Stable Minimal Surfaces Bounded by Jordan Curves in Close Planes

We study compact stable embedded minimal surfaces whose boundary is given by two collections of closed smooth Jordan curves in close planes of Euclidean Three-Space. Our main result is a classification of these minimal surfaces, under certain natural geometric asymptotic constraints, in terms of certain associated varifolds which can be enumerated explicitely. One consequence of this result is ...

متن کامل

Convex hulls of more-part Sperner families

The convex hulls of more-part Sperner families is defined and studied. Corollaries of the results are some well-known theorems on 2 or 3-part Sperner families. Some methods are presented giving new theorems.

متن کامل

Solving the \nearest Point on Object" Problem Using Recursive Subdivision Solving the \nearest Point on Object" Problem Using Recursive Subdivision

Finding the nearest point on a given 2D or 3D object computation is a problem that arises in many computer graphics applications, such as interactive modeling, rendering of implicit surfaces or collision detection. Unfortunately, for objects with complex geometry such as curves or surfaces, the computation cost becomes prohibitive as a minimization process acting in multiple dimensions has to b...

متن کامل

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1311.6331  شماره 

صفحات  -

تاریخ انتشار 2013